The negation of the Boolean expression $x \leftrightarrow \sim y$ is equivalent to

  • A
    $(\sim x \wedge y) \vee (\sim x \wedge \sim y)$
  • B
    $(x \wedge \sim y) \vee (\sim x \wedge y)$
  • C
    $(x \wedge y) \vee (\sim x \wedge \sim y)$
  • D
    $(x \wedge y) \wedge (\sim x \vee \sim y)$

Explore More

Similar Questions

Let $S$ be a non-empty subset of $\mathbb{R}$. Consider the following statement:
$p$ : There is a rational number $x \in S$ such that $x > 0$.
Which of the following statements is the negation of the statement $p$?

Find the component statements of the following and check whether they are true or not.
$24$ is a multiple of $2, 4$ and $8$.

The negation of the statement pattern $p \vee (q \rightarrow \sim r)$ is

$\sim (p \Rightarrow q) \Leftrightarrow \sim p \vee \sim q$ is

If $p \Rightarrow (\sim p \vee q)$ is false,the truth values of $p$ and $q$ are respectively

Vedclass Products

For Students

Vedclass Test Series

Mock tests in real JEE/NEET style with performance analysis. 5-day free trial.

Start Free Trial
For Teachers

Exam Paper Generator

Generate Set A/B/C/D exam papers from 7.5L+ questions in 2 minutes. 3 chapters free.

Try Free
For Institutes

Online Exam Module

Live online exams with unlimited students, 360° analytics & white-label branding.

See Demo